PEMBUATAN GAME BERBASIS PEMBELAJARAN MENGGUNAKAN RPG MAKER MV

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

"Playing RPG Maker"? Amateur Game Design and Video Gaming

Game creation tools like Game Maker or RPG Maker democratize game making and facilitate the development of amateur game design. The best known among these programs have dynamic web-communities with active members making thousands of games. However, as of now, there is little research on amateur game design except for modding or education fields. In this paper I argue that approaching amateur ga...

متن کامل

Doubly Biased Maker-Breaker Connectivity Game

In this paper we study the (a : b) Maker-Breaker Connectivity game, played on the edge set of the complete graph on n vertices. We determine the winner for almost all values of a and b.

متن کامل

Optimization of AI Tactic in Action-RPG Game

In an Action RPG game, usually there is one or more player character. Also, there are many enemies and bosses. Player should kill as many as possible to get more experience. A smart AI is needed to increase the game challenge. In this research, a method is proposed to optimize the enemy AI strategy, by implementing enemy units grouping, and attacking in group using hit and run strategy against ...

متن کامل

Pengaruh Perangkat Server Terhadap Kualitas Pengontrolan Jarak Jauh Melalui Internet

Internet sangat membantu dalam memperbaiki kualitas kehidupan manusia. Hampir semua bidang kehidupan manusia dapat diakses menggunakan internet. Manusia terbantu dengan adanya internet yang menyediakan segala macam informasi yang dibutuhkan. Seiring dengan perkembangan infrastuktur jaringan internet maka pengontrolan jarak jauh mulai berubah menggunakan media internet. Pada penelitian ini digun...

متن کامل

A threshold for the Maker-Breaker clique game

We look at Maker-Breaker k-clique game played on the edge set of the random graph G(n, p). In this game, two players, Maker and Breaker, alternately claim unclaimed edges of G(n, p), until all the edges are claimed. Maker wins if he claims all the edges of a k-clique; Breaker wins otherwise. We determine that the property that Maker can win this game has a threshold at n− 2 k+1 , for all k > 3....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal Of Computer Networks, Architecture and High Performance Computing

سال: 2018

ISSN: 2655-9102

DOI: 10.47709/cnapc.v1i1.5